Tight Galois Connections and Complete Distributivity
نویسندگان
چکیده
منابع مشابه
Boundedness and Complete Distributivity
We extend the concept of constructive complete distributivity so as to make it applicable to ordered sets admitting merely bounded suprema The KZ doctrine for bounded suprema is of some independent interest and a few results about it are given The category of ordered sets admitting bounded suprema over which inhabited classically non empty in ma distribute is shown to be bi equivalent to a cate...
متن کاملConstructive Complete Distributivity II
A complete lattice L is constructively completely distributive CCD L if the sup map de ned on down closed subobjects has a left adjoint It was known that in boolean toposes CCD L is equivalent to CCD L We show here that the latter property for all L su ciently for characterizes boolean toposes Research partially supported by grants from NSERC Canada Diagrams typeset using catmac Introduction Th...
متن کاملConstructive complete distributivity IV
A complete lattice L is constructively completely distributive CCD when the sup arrow from down closed subobjects of L to L has a left adjoint The Karoubian envelope of the bicategory of relations is biequivalent to the bicategory of CCD lattices and sup preserving arrows There is a restriction to order ideals and totally algebraic lattices Both biequivalences have left exact ver sions As appli...
متن کاملMany-Valued Complete Distributivity
Suppose (Ω, ∗, I) is a commutative, unital quantale. Categories enriched over Ω can be studied as generalized, or many-valued, ordered structures. Because many concepts, such as complete distributivity, in lattice theory can be characterized by existence of certain adjunctions, they can be reformulated in the many-valued setting in terms of categorical postulations. So, it is possible, by aid o...
متن کاملPair algebras and Galois connections
Most studies of Galois connections begin with a function and ask the question: when is there a second function that is connected to the first? In possibly the very first application of Galois connections directly related to the modern digital computer, Hartmanis and Stearns posed a. subtly different question, namely: when does a relation define two functions that are Ga'!ois connected? Such a r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1960
ISSN: 0002-9947
DOI: 10.2307/1993380